An exceptional set for inner functions
نویسندگان
چکیده
منابع مشابه
The size of the exceptional set of an asymptotic basis
Problems related to the study of the asymptotic basis sets of integers belong to the realm of “additive number theory”. In this note we survey a representative problem concerning the number of the elements of a basis with the property that, if we extract one of them from the initial set, the remaining set is not a basis anymore. It summarizes the article written by G. Grekos and B. Deschamps: “...
متن کاملExceptional Sets for Universally Polygonally Approximable Functions
In [9], the present authors and Richard O’Malley showed that in order for a function be universally polygonally approximable it is necessary that for each ε > 0, the set of points of non-quasicontinuity be σ − (1− ε) symmetrically porous. The question as to whether that condition is sufficient or not was left open. Here we prove that if a set, E = S∞ n=1 En, such that each Ei is closed and 1-sy...
متن کاملA divisibility criterion for exceptional APN functions
We are interested in the functions from F2m to itself which are Almost Perfectly Nonlinear over infinitely many extensions of F2, namely, the exceptional APN functions. In particular, we study the case of the polynomial functions of degree 4e with e odd and we give a necessary condition on an associated multivariate polynomial for the function to be exceptional APN. We use this condition to con...
متن کاملOne-component inner functions
© The Author(s) 2017. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if c...
متن کاملAn analysis of approximations for maximizing submodular set functions - I
Let N be a finite set and z be a real-valued function defined on the set of subsets of N that satisfies z(S)+z(T)>-z(SUT)+z(SnT) for all S, T in N. Such a function is called submodular. We consider the problem maXscN {z(S): IS[ <-K, z(S) submodular}. Several hard combinatorial optimization problems can be posed in this framework. For example, the problem of finding a maximum weight independent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1971
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1971-0281922-3